On Weaknesses of Non-surjective Round Functions
نویسندگان
چکیده
We propose a new attack on Feistel ciphers with a non-surjective round function. CAST and LOKI91 are examples of such ciphers. We extend the attack towards ciphers that use a non–uniformly distributed round function and apply the attack to CAST.
منابع مشابه
Cryptanalysis of a Generalized Unbalanced Feistel Network Structure
This paper reevaluates the security of GF-NLFSR, a new kind of generalized unbalanced Feistel network structure that was proposed at ACISP 2009. We show that GF-NLFSR itself reveals a very slow diffusion rate, which could lead to several distinguishing attacks. For GF-NLFSR containing n sub-blocks, we find an n-round integral distinguisher by algebraic methods and further use this integral to c...
متن کاملCryptanalysis of some first round CAESAR candidates
ΑΕS _ CMCCv₁, ΑVΑLΑNCHEv₁, CLΟCv₁, and SILCv₁ are four candidates of the first round of CAESAR. CLΟCv₁ is presented in FSE 2014 and SILCv₁ is designed upon it with the aim of optimizing the hardware implementation cost. In this paper, structural weaknesses of these candidates are studied. We present distinguishing attacks against ΑES _ CMCCv₁ with the complexity of two queries and the success ...
متن کاملSierpiński Index of Classical Transformation Semigroups
We prove that any countable set of surjective functions on an infinite set of cardinality אn with n ∈ N can be generated by at most n2/2 + 9n/2 + 5 surjective functions of the same set; and there exist n2/2 + 9n/2 + 5 surjective functions that cannot be generated by any smaller number of surjections. If injective functions are considered instead of surjective functions, then n + 4 replaces n2/2...
متن کاملGenerating Countable Sets of Surjective Functions
We prove that any countable set of surjective functions on an infinite set of cardinality אn with n ∈ N can be generated by at most n/2 + 9n/2 + 7 surjective functions of the same set; and there exist n/2 + 9n/2 + 7 surjective functions that cannot be generated by any smaller number of surjections. We also present several analogous results for other classical infinite transformation semigroups ...
متن کاملDistinguishing Attacks on a Kind of Generalized Unbalanced Feistel Network
Recently, a new kind of Generalized Unbalanced Feistel Network, denoted as GUFN-n, is proposed by Choy et al. at ACISP 2009. The advantages of this structure are that it allows parallel computations for encryption and it can provide provable security against traditional differential and linear cryptanalysis given that the round function is bijective. For this new structure, the designers also f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 12 شماره
صفحات -
تاریخ انتشار 1997